Invited Lecture: Predicting the Flexibility and Rigidity of Proteins: Geometry, Combinatorics, Conjectures, and Algorithms
نویسنده
چکیده
The rigidity and flexibility of proteins is critical to what they do in the body, and how drugs can change this. Both too rigid and too flexibly proteins are the source of diseases in humans and predicting flexibility from a 3-D structural file is an important challenge. We present one computational approach, currently implemented at flexweb.asu.edu, based on the geometric, combinatorial and algorithmic theory of framework rigidity. We introduce the general problems and methods of rigidity through plane frameworks, with examples and models. We describe the long-standing unsolved problems for frameworks in 3-space as well as the newer solved theory of body hinge structures (also with models). Recent work has refined these spatial theories for proteins through a pair of Molecular Conjectures that provide a basis for fast combinatorial algorithms for this special class of structures. We describe the steps current programs for proteins, from extracting a constraint graph from the geometry and biochemistry of the protein, through the application of these combinatorial rigidity algorithms to predictions of the “snap shot” rigidity and flexibility of a protein. We also describe some extensions to predictions of dynamic paths and other problems.
منابع مشابه
Combinatorics, Symmetric Functions, and Hilbert Schemes
We survey the proof of a series of conjectures in combinatorics using new results on the geometry of Hilbert schemes. The combinatorial results include the positivity conjecture for Macdonald’s symmetric functions, and the “n!” and “(n + 1)n−1” conjectures relating Macdonald polynomials to the characters of doubly-graded Sn modules. To make the treatment self-contained, we include background ma...
متن کاملInvited Lecture: Real Numbers and Robustness in Computational Geometry
Robustness issues due to imprecise arithmetic used in place of exact real number computation are a notorious problem in the implementation of geometric algorithms. We briefly address some robustness issues and discuss approaches to resolve them.
متن کاملHopf Algebras in Combinatorics
Certain Hopf algebras arise in combinatorics because they have bases naturally parametrized by combinatorial objects (partitions, compositions, permutations, tableaux, graphs, trees, posets, polytopes, etc). The rigidity in the structure of a Hopf algebra can lead to enlightening proofs, and many interesting invariants of combinatorial objects turn out to be evaluations of Hopf morphisms. These...
متن کاملPredicting Adolescents’ Self-Differentiation and Attachment Styles Based on Family Flexibility, Parents’ Level of Self-Differentiation and Parental Attachment Styles
Predicting Adolescents’ Self-Differentiation and Attachment Styles Based on Family Flexibility, Parents’ Level of Self-Differentiation and Parental Attachment Styles F. Asl Dehghan, M.A. H. Rezaian, Ph.D. S. Hosseinian, Ph.D. The main purpose of the present study was to determine the role of family flexibility, parents’ level of self-differentiation, and pa...
متن کاملOn the Symmetric Molecular Conjectures
Amolecular linkage consists of a set of rigid bodies pairwise connected by revolute hinges, so that all hinge lines of each body are concurrent in a single point. It is an important problem in biochemistry, as well as in robotics, to efficiently analyze the motions and configuration spaces of such linkages. The well-developed mathematical theory of generic rigidity of body-bar frameworks permit...
متن کامل